Noise Removal Algorithm for Polygonal Meshes
نویسندگان
چکیده
In this paper, we present an effective unshrinkage noise removal algorithm to generate smooth geometric models. By introducing the constraints of keeping all triangle barycenters invariant at each smoothing step, the algorithm converts the mesh fairing issue into the minimization of the constrained energy minimization functional, which is then solved efficiently by our iterative method. The experimental results demonstrate that our algorithm can not only quickly remove the noise with good shape preservation, but also be implemented efficiently and robustly.
منابع مشابه
Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain
Digital watermarking embeds a structure called watermark into the target data, such as image and 3D polygonal models. The watermark can be used, for example, to enforce copyright and to detect tampering. This paper presents a new robust watermarking method that adds watermark into a 3D polygonal mesh in the mesh’s spectral domain. The algorithm computes spectra of the mesh by using eigenvalue d...
متن کاملGeometric Signal Processing on Polygonal Meshes
Very large polygonal models, which are used in more and more graphics applications today, are routinely generated by a variety of methods such as surface reconstruction algorithms from 3D scanned data, isosurface construction algorithms from volumetric data, and photogrametric methods from aerial photography. In this report we provide an overview of several closely related methods developed dur...
متن کاملPolygonal silhouette error correction: a reverse subdivision approach
A method for automatic removal of artifacts and errors that can appear in silhouettes extracted from polygonal meshes is presented and evaluated. These errors typically appear in polygonal silhouettes due to the discrete nature of meshes and numerical instabilities. The approach presented works in object space on silhouette curves made by chaining together silhouette edges and uses multiresolut...
متن کاملSpectral Graph and Minimal Spanning Tree for 3D Polygonal Meshes Fingerprinting
In this paper, the authors present a robust three-dimensional fingerprint algorithm for verification, indexing, and identification. The core idea behind our technique is to apply the eigen-decomposition to the mesh Laplacian matrix, and then compute minimum spanning trees (MST) of several concentrations of the mesh shape structure. The fixed size hash vector of a 3D mesh is defined in terms of ...
متن کاملReverse Subdivision Multiresolution for Polygonal Silhouette Error Correction
This paper presents a method for automatic removal of artifacts that appear in silhouettes extracted from polygonal meshes due to the discrete nature of meshes and numerical instabilities. The approach works in object space on curves made by chaining silhouette edges and uses multiresolution techniques based on a reverse subdivision method. These artifact-free curves are then rendered in object...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006